An Improved Population Migration Algorithm for Solving Multi-Objective Optimization Problems
نویسندگان
چکیده
منابع مشابه
An Improved Population Migration Algorithm for Solving Multi-Objective Optimization Problems
The population migration algorithm is a very effective evolutionary algorithm for solving single-objective optimization problems, but very few applications are available for solving multi-objective optimization problems (MOPs). The current study proposes an improved population migration algorithm for solving MOPs based on the vector evaluated method and the dynamic weighted aggregation. The loc...
متن کاملAn Improved Differential Evolution Algorithm for Multi-objective Optimization Problems
In this paper, an improved multi-objective differential evolution algorithm(IDEA) is proposed for multi-objective optimization problems. In IDEA, the select operator combines the advantages of DE with the mechanisms of Pareto-based ranking and distance density, besides, a randomly migration strategy is proposed. IDEA is implemented on four classical multi-objective problems, the simulation resu...
متن کاملAn Improved Multi-Objective Genetic Algorithm for Solving Multi-objective Problems
Multi-objective optimization (MO) has been an active area of research in the last two decades. In multi-objective genetic algorithm (MOGA), the quality of newly generated offspring of the population will directly affect the performance of finding the Pareto optimum. In this paper, an improved MOGA, named SMGA, is proposed for solving multi-objective optimization problems. To increase efficiency...
متن کاملDifferential Evolution Algorithm for Solving Multi-objective Optimization Problems
This paper presents a modified Differential Evolution (DE) algorithm called OCMODE for solving multi-objective optimization problems. First, the initialization phase is improved by using the opposition based learning. Further, a time varying scale factor F employing chaotic sequence is used which helps to get a well distributed Pareto front by the help of non dominated and crowding distance sor...
متن کاملAn Improved Bat Algorithm with Grey Wolf Optimizer for Solving Continuous Optimization Problems
Metaheuristic algorithms are used to solve NP-hard optimization problems. These algorithms have two main components, i.e. exploration and exploitation, and try to strike a balance between exploration and exploitation to achieve the best possible near-optimal solution. The bat algorithm is one of the metaheuristic algorithms with poor exploration and exploitation. In this paper, exploration and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computational Intelligence Systems
سال: 2012
ISSN: 1875-6891,1875-6883
DOI: 10.1080/18756891.2012.733232